Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages
نویسندگان
چکیده
Let q be a prime power and g ∈ {6, 8, 12}. In this paper we obtain (q, g)-graphs on 2qg/2−3(q2 − 1) vertices for g = 6, 8, 12 as subgraphs of known (q + 1, g)-cages. We also obtain (q − r, 6)-graphs on 2(q2 − rq − 1) vertices, and (q − r, 8)-graphs on 2(q3−rq2−q+r) vertices where r is a positive integer such that q ≥ r+3. Furthermore, we find (q − 1, 12)-graphs of order 2q2(q3 − q2 − q + 1). Some of these graphs have the smallest number of vertices known so far among the regular graphs with girth g = 6, 8, 12.
منابع مشابه
On Subgraphs in Distance-Regular Graphs
Terwilliger [15] has given the diameter bound d < (s 1)(k 1) + 1 for distance-regular graphs with girth 2s and valency k. We show that the only distance-regular graphs with even girth which reach this bound are the hypercubes and the doubled Odd graphs. Also we improve this bound for bipartite distance-regular graphs. Weichsel [17] conjectures that the only distance-regular subgraphs of a hyper...
متن کاملMinimal regular graphs with given girths and crossing numbers
This paper investigates on those smallest regular graphs with given girths and having small crossing numbers.
متن کاملOPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD
In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of th...
متن کاملOPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD
In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of the ...
متن کاملEfficient Search of QC-LDPC Codes with Girths 6 and 8 and Free of Elementary Trapping Sets with Small Size
One of the phenomena that influences significantly the performance of low-density parity-check codes is known as trapping sets. An (a, b) elementary trapping set, or simply an ETS where a is the size and b is the number of degree-one check nodes and b a < 1, causes high decoding failure rate and exert a strong influence on the error floor. In this paper, we provide sufficient conditions for exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 310 شماره
صفحات -
تاریخ انتشار 2010